Binary decision diagram minimization algorithm based on genetic tabu hybrid strategy 基于遺傳禁忌混合策略的二叉判定圖最小化算法研究
3 . a modern combination algorithm saa ( simulated annealing algorithm ) is applied in area minimization algorithms 3 .將現(xiàn)代組合優(yōu)化算法模擬退火算法應(yīng)用于面積優(yōu)化算法中,取得了較好的效果。
This paper is concerned with the classification of fuzzy finite automata and the minimization algorithm of fuzzy finite automata 本文研究了模糊有限自動機的分類和模糊有限自動機的狀態(tài)最小化算法。
4 . a famous depth minimization algorithm flowmap is described and implemented . a new technology are applied in computing maximal flow of a boolean network 4 .自主實現(xiàn)了flowmap算法,利用布爾網(wǎng)絡(luò)的特點,采用新的標(biāo)號法求得網(wǎng)絡(luò)的最大流。
In chapter 3 the torque ripple minimization algorithm based on torque observation and instant torque control is studied as well as the fuzzy pid controller does 在分析兩種轉(zhuǎn)矩脈動抑制方法局限性基礎(chǔ)上,研究了基于轉(zhuǎn)矩觀測的瞬時轉(zhuǎn)矩脈動抑制算法以及轉(zhuǎn)速環(huán)的模糊pid控制器設(shè)計。
In this paper , based on the method of boolean manipulation and minimization algorithm in the independence minimal path sets , and applied reliability engineering theory , a new method is proposed for calculating reliability of mine ventilation network system 摘要運用可靠性工程理論及不交型積之和定律,在大型網(wǎng)絡(luò)系統(tǒng)可靠度計算的基礎(chǔ)上,提出了礦井通風(fēng)網(wǎng)絡(luò)系統(tǒng)最大線性無關(guān)最小獨立路集予以真子集滌除的不交化可靠度計算的實現(xiàn)方法。
From the equivalence relations , a minimal form is defined and a minimization algorithm of the mealy type of fuzzy finite automata is obtained . in chapter 3 , a fuzzy finite automata with a fuzzy initial state that was first considered by m . mizumoto , j . toyota and k . tanaka in 1969 is introduced . based on the mizumoto type of fuzzy finite automata , a statewise equivalence relation is considered 在第三章中,我們首先介紹了一類有模糊初始狀態(tài)的模糊有限自動機- mizumoto型模糊有限自動機,然后定義了兩種狀態(tài)等價和兩種模糊有限自動機等價的概念,接著證明了對于每一個mizumoto型模糊有限自動機,都存在一個與之等價的狀態(tài)最小化模糊有限自動機,并且給出了一個狀態(tài)最小化約簡算法及其算法終止條件。
From the equivalence relation , a minimal form is defined and a minimization algorithm of the mizumoto type of fuzzy finite automata is obtained . in chapter 4 , quantum automata are introduced . we compare and contrast quantum automata with fuzzy finite automata , obtain some elementary relations and leave a set of open questions 在第四章中,首先了介紹量子自動機的概念,然后著重比較量子自動機與一種模糊有限自動機(即mizumoto型模糊有限自動機)之間的異同點,得到了量子自動機與模糊有限自動機關(guān)系的一些初步想法。
On the basis of the method of boolean manipulation and minimization algorithm , when the independence minimal path sets is arranged by sort ascending according to the mine ventilation network branches , the calculation capacity of the middle course still can reducing further , and thus the optimum effect of boolean manipulation and minimization algorithm is achieved to calculating reliability of mine ventilation network system 根據(jù)不交化可靠度計算法,當(dāng)最小獨立路集按所含網(wǎng)絡(luò)分支的多少進(jìn)行升序排列時,還可進(jìn)一步減少中間過程的計算量,從而達(dá)到最佳不交化簡化計算的效果。
The living example analysis shows that the two results are not only equal according to the full probability formula and deleting truth subsets in the calculation of system reliability for mine ventilation network based on boolean manipulation and minimization algorithm in the independence minimal path sets , but also it is fewer to possess boolean manipulations in the calculation and the calculating program is simplified greatly to the method of boolean manipulation and minimization algorithm in the independence minimal path sets 實例分析表明:采用升序排列的最小獨立路集并按不交型積之和定理予以真子集滌除的不交化處理后,不僅計算值等同于一般網(wǎng)絡(luò)分析中用全概率公式計算的礦井通風(fēng)網(wǎng)絡(luò)系統(tǒng)可靠度,而且,計算工作量大為簡化。